B1-EPG representations using block-cutpoint trees

In this paper, we are interested in the edge intersection graphs of paths a grid where each path has at most one bend, called B 1 -EPG and first introduced by Golumbic et al (2009). We also consider proper subclass -EPG, x graphs, which allows only “ ” shape. show that two superclasses trees (one them being cactus graphs). On other hand, block provide linear time algorithm to produce representations generalization trees. These proofs employed new technique from previous results area based on block-cutpoint respective graphs.